Spherical Designs, Discrepancy and Numerical Integration
نویسندگان
چکیده
A spherical design is a point configuration on the sphere, which yields exact equal-weight quadrature formulae for polynomials up to a given degree. Until now only very specific constructions for spherical designs are known. We establish connections to spherical cap discrepancy and show some general discrepancy bounds. Furthermore, we reformulate the problem of constructing designs as an optimization problem and develop an algorithm for finding 'practical designs'.
منابع مشابه
Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial over the sphere. This paper considers the characterization and computation of spherical t-designs on the unit sphere S2 ⊂ R3 when N ≥ (t + 1)2, the dimension of the space Pt of spherical polynomials of degree at most t...
متن کاملThe Department of Mathematical Sciences
Spherical t-designs on the unit sphere S ⊂ R, introduced by Delsarte, Goethals, and Seidel (1977), are equal weight numerical integration rules that are exact for all polynomials of degree at most t on S. This talk considers the calculation and properties of of spherical t-designs, in particular for S where most applications reside. Bondarenko, Radchenko, and Viazovska (2013) proved that there ...
متن کاملQuadrature on a Spherical Surface Casper H. L. Beentjes
Approximately calculating integrals over spherical surfaces in R3 can be done by simple extensions of one dimensional quadrature rules. This, however, does not make use of the symmetry or structure of the integration domain and potentially better schemes can be devised by directly using the integration surface in R3. We investigate several quadrature schemes for integration over a spherical sur...
متن کاملSPHERICAL tε-DESIGNS FOR APPROXIMATIONS ON THE SPHERE
A spherical t-design is a set of points on the unit sphere that are nodes of a quadrature rule with positive equal weights that is exact for all spherical polynomials of degree ≤ t. The existence of a spherical t-design with (t + 1)2 points in a set of interval enclosures on the unit sphere S2 ⊂ R3 for any 0 ≤ t ≤ 100 is proved in [17, Chen, Frommer, Lang, Computational existence proofs for sph...
متن کاملOn the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms
Spherical t-designs are point sets XM := {x1, . . . ,xM} ⊂ S2 which provide quadrature rules with equal weights for the sphere which are exact for polynomials up to degree t. In this paper we consider the problem of finding numerical spherical t-designs on the sphere S2 for high polynomial degree t ∈ N. That is, we compute numerically local minimizers of a certain quadrature error At(XM ). The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010